Hitting and Piercing Rectangles Induced by a Point Set
نویسندگان
چکیده
We consider various hitting and piercing problems for the family of axis-parallel rectangles induced by a point set. Selection Lemmas on induced objects are classical results in discrete geometry that have been well studied and have applications in many geometric problems like weak epsilon nets and slimming Delaunay triangulations. Selection Lemma type results typically bound the maximum number of induced objects that are hit/pierced by a single point. First, we prove an exact result on the strong and the weak variant of the First Selection Lemma for rectangles. We also show bounds for the Second Selection Lemma which improve upon previous bounds when there are near-quadratic number of induced rectangles. Next, we consider the hitting set problem for induced rectangles. This is a special case of the geometric hitting set problem which has been extensively studied. We give efficient algorithms and show exact combinatorial bounds on the hitting set problem for two special classes of induced axis-parallel rectangles. Finally, we show that the minimum hitting set problem for all induced lines is NP-Complete.
منابع مشابه
Selection Lemmas for various geometric objects
Selection lemmas are classical results in discrete geometry that have been well studied and have applications in many geometric problems like weak epsilon nets and slimming Delaunay triangulations. Selection lemma type results typically show that there exists a point that is contained in many objects that are induced (spanned) by an underlying point set. In the first selection lemma, we conside...
متن کاملOn Piercing Sets of Axis-Parallel Rectangles and Rings
We consider the p-piercing problem for axis-parallel rectangles. We are given a collection of axis-parallel rectangles in the plane, and wish to determine whether there exists a set of p points whose union intersects all the given rectangles. We present eecient algorithms for nding a piercing set (i.e., a set of p points as above) for values of p = 1; 2; 3; 4; 5. The result for 4 and 5-piercing...
متن کاملApproximating hitting sets of axis-parallel rectangles intersecting a monotone curve
In this note, we present a simple combinatorial factor 6 algorithm for approximating the minimum hitting set of a family R = {R1, . . . ,Rn} of axis-parallel rectangles in the plane such that there exists an axis-monotone curve γ that intersects each rectangle in the family. The quality of the hitting set is shown by comparing it to the size of a packing (set of pairwise non-intersecting rectan...
متن کاملApproximating hitting sets of axis-parallel rectangles with opposite corners separated by a monotone curve
In this note, we present a simple combinatorial factor 8 algorithm for approximating the minimum hitting set of a family R = {R1, . . . ,Rn} of axis-parallel rectangles in the plane such that there exists an axis-monotone curve γ separating the same two opposite corners of each rectangle Ri (say, the lower left and upper right corners).
متن کاملEnumerating Minimal Transversals of Geometric Hypergraphs
We consider the problem of enumerating all minimal hitting sets of a given hypergraph (V,R), where V is a finite set, called the vertex set andR is a set of subsets of V called the hyperedges. We show that, when the hypergraph admits a balanced subdivision, then a recursive decomposition can be used to obtain efficiently all minimal hitting sets of the hypergraph. We apply this decomposition fr...
متن کامل